Fast construction of higher order digital nets for numerical integration in weighted Sobolev spaces
نویسندگان
چکیده
منابع مشابه
Cyclic Digital Nets, Hyperplane Nets, and Multivariate Integration in Sobolev Spaces
Abstract. Cyclic nets are a special case of digital nets and were recently introduced by Niederreiter. Here we present a construction algorithm for such nets, where we use the root mean square worst-case error of a randomly digitally shifted point set in a weighted Sobolev space as a selection criterion. This yields a feasible construction algorithm since for a cyclic net with qm points (with f...
متن کاملConstruction Algorithms for Digital Nets with Low Weighted Star Discrepancy
We introduce a new construction method for digital nets which yield point sets in the s-dimensional unit cube with small star discrepancy. The digital nets are constructed using polynomials over finite fields. It has long been known that there exist polynomials which yield point sets with small (unweighted) star discrepancy. This result was obtained by Niederreiter by the means of averaging ove...
متن کاملHigher Order Numerical Discretization Methods with Sobolev Norm Minimization
This paper presents a method of producing higher order discretization weights for linear differential and integral operators using the Minimum Sobolev Norm idea[1][2] in arbitrary geometry and grid configurations. The weight computation involves solving a severely ill-conditioned weighted least-squares system. A method of solving this system to very high-accuracy is also presented, based on the...
متن کاملA reduced fast component-by-component construction of lattice points for integration in weighted spaces with fast decreasing weights
Lattice rules and polynomial lattice rules are quadrature rules for approximating integrals over the s-dimensional unit cube. Since no explicit constructions of such quadrature methods are known for dimensions s > 2, one usually has to resort to computer search algorithms. The fast component-by-component approach is a useful algorithm for finding suitable quadrature rules. We present a modifica...
متن کاملThe Kawahara equation in weighted Sobolev spaces
Abstract The initialand boundary-value problem for the Kawahara equation, a fifthorder KdV type equation, is studied in weighted Sobolev spaces. This functional framework is based on the dual-Petrov–Galerkin algorithm, a numerical method proposed by Shen (2003 SIAM J. Numer. Anal. 41 1595–619) to solve third and higher odd-order partial differential equations. The theory presented here includes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Numerical Algorithms
سال: 2014
ISSN: 1017-1398,1572-9265
DOI: 10.1007/s11075-014-9902-4